Complete graphs: the space of simplicial cones, and their path tree representation
نویسندگان
چکیده
Let G be a complete graph with n+ 1 vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with the graph. Motivated by the above, we take here a closer look at the geometry of the simplicial cones associated with the graph, and the role played by those simplicial cones that are generated by path trees. It is shown that the latter form a basis for the linear space spanned by the former, and that the representation of a general simplicial cone by path tree cones can be deduced by examining partial orders induced by rooted trees. While the problem itself is geometrical and its solution is combinatorial, the proofs rest with multivariate spline theory. AMS (MOS) Subject Classifications: Primary: 41A15, 41A63, 13F20, 13N10, 52B40, 05B35, 47L20. Secondary: 52C35, 13P25, 05C05, 05C07, 05C20, 05E99, 52C40.
منابع مشابه
Vertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملSimplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملSOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017